Low-density parity-check codes for volume holographic memory systems.

نویسندگان

  • Hossein Pishro-Nik
  • Nazanin Rahnavard
  • Jeongseok Ha
  • Faramarz Fekri
  • Ali Adibi
چکیده

We investigate the application of low-density parity-check (LDPC) codes in volume holographic memory (VHM) systems. We show that a carefully designed irregular LDPC code has a very good performance in VHM systems. We optimize high-rate LDPC codes for the nonuniform error pattern in holographic memories to reduce the bit error rate extensively. The prior knowledge of noise distribution is used for designing as well as decoding the LDPC codes. We show that these codes have a superior performance to that of Reed-Solomon (RS) codes and regular LDPC counterparts. Our simulation shows that we can increase the maximum storage capacity of holographic memories by more than 50 percent if we use irregular LDPC codes with soft-decision decoding instead of conventionally employed RS codes with hard-decision decoding. The performance of these LDPC codes is close to the information theoretic capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irregular repeat-accumulate codes for volume holographic memory systems.

We investigate the application of irregular repeat-accumulate (IRA) codes in volume holographic memory (VHM) systems. We introduce methodologies to design efficient IRA codes. We show that a judiciously designed IRA code for a typical VHM can be as good as the optimized irregular low-density-parity-check codes while having the additional advantage of lower encoding complexity. Moreover, we pres...

متن کامل

Encoding Schemes for Memory Efficient Quasi Cyclic Low Density Parity Check Codes

Low Density Parity Check (LDPC) codes have attracted current researchers due to their excellent performance and capability of parallel decoding. One major criticism concerning LDPC codes has been their apparent high encoding complexity and memory inefficient nature due to large parity check matrix. This led the researchers to move into a memory efficient LDPC called Quasi-Cyclic (QC)-LDPC which...

متن کامل

Low - Density Parity Check Codes for Fading Channelswith

We develop a belief-propagation-based joint decoding and channel state estimation algorithm for low-density parity check codes on fading channels with memory. The excellent empirical performance of LDPC codes on the AWGN channel and the possibility of arranging the code memory relative to the channel correlation suggests that LDPC codes have the potential to perform well on fading channels with...

متن کامل

A Memory Efficient FPGA Implementation of Quasi-Cyclic LDPC Decoder

Low-Density Parity-Check (LDPC) code is one kind of prominent error correcting codes (ECC) being considered in next generation industry standards. The decoder implementation complexity has been the bottleneck of its application. This paper presents an implementation of Quasi-Cyclic Low-Density Parity-Check decoder by using FPGA. Modified Min-Sum decoding algorithm is applied to reduce the memor...

متن کامل

Memory Efficient Decoders using Spatially Coupled Quasi-Cyclic LDPC Codes

In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for Xilinx FPGA to compare the logic and memory requirements for various...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied optics

دوره 42 5  شماره 

صفحات  -

تاریخ انتشار 2003